منابع مشابه
Non-Stanley Bounds for Network Reliability
Suppose that each edge of a connected graph G of order n is independently operational with probability p; the reliability of G is the probability that the operational edges form a spanning connected subgraph. A useful expansion of the reliability is as pn-1 5dj=0 Hi(l — p ) i , and the Ball-Provan method for bounding reliability relies on Stanley's combinatorial bounds for the H-vectors of shel...
متن کاملLower Bounds for Two-Terminal Network Reliability
One measure of two-terminal network reliability, termed probabilistic connectedness, is the probability that two specified communication centers can communicate. A standard model of a network is a graph in which nodes represent communications centers and edges represent links between communication centers. Edges are assumed to have statistically independent probabilities of failing and nodes ar...
متن کاملBounds of Stanley depth
We answer positively a question of Asia Rauf for the case of intersections of three prime ideals generated by disjoint sets of variables and we present several inequalities on Stanley depth. This is a detailed presentation of our talk at the conference on ”Fundamental structures of algebra” in honor of Prof. Serban Basarab at his 70-th anniversary. Let S = K[x1, . . . , xn] be a polynomial alge...
متن کاملLower bounds on two-terminal network reliability
Computing the probability that two nodes in a probabilistic network are connected is a wellknown computationally difficult problem. Two strategies are devised for obtaining lower bounds on the connection probability for two terminals. The first improves on the Kruskal-Katona bound by using efficient computations of small pathsets. The second strategy employs efficient algorithms for finding edg...
متن کاملMultiplicative improvements in network reliability bounds
In the network design process, one goal is to select a network topology which is highly reliable. Although there is no universally accepted measure of reliability, the most widely used definition is a probabilistic one. The network is modelled as a probabilistic graph G = (V ,E) , in which V is a set of nodes representing sites in the network, and E is a collection of undirected edges represent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 1996
ISSN: 0925-9899,1572-9192
DOI: 10.1007/bf00186526